Several classes of binary sequences with three-level autocorrelation
نویسندگان
چکیده
In this correspondence we describe several classes of binary sequences with three-level autocorrelation. Those classes of binary sequences are based on cyclic almost difference sets. Some classes of binary sequences have optimum autocorrelation.
منابع مشابه
A General Construction of Binary Sequences with Optimal Autocorrelation
A general construction of binary sequences with low autocorrelation are considered in the paper. Based on recent progresses about this topic and this construction, several classes of binary sequences with optimal autocorrelation and other low autocorrelation are presented.
متن کاملNew families of binary sequences with optimal three-level autocorrelation
In this correspondence we give several new families of binary sequences of period with optimal three-level autocorrelation, where 2(mod 4). These sequences are either balanced or almost balanced. Our construction is based on cyclotomy.
متن کاملRealizations from Decimation Hadamard Transform for Special Classes of Binary Sequences with Two-Level Autocorrelation
In an effort to search for a new binary two-level autocorrelation sequence, the decimation-Hadamard transform (DHT) based on special classes of known binary sequences with two-level autocorrelation is investigated. It is theoretically proved that some realizations of a binary generalized Gordon-Mills-Welch (GMW) sequence can be predicted from the structure of subfield factorization and the real...
متن کاملOn a Class of Almost Difference Sets Constructed by Using the Ding-Helleseth-Martinsens Constructions
Pseudorandom binary sequences with optimal balance and autocorrelation have many applications in stream cipher, communication, coding theory, etc. It is known that binary sequences with three-level autocorrelation should have an almost difference set as their characteristic sets. How to construct new families of almost difference set is an important research topic in such fields as communicatio...
متن کاملLinear Complexity and Autocorrelation of two Classes of New Interleaved Sequences of Period 2N
The autocorrelation and the linear complexity of a key stream sequence in a stream cipher are important cryptographic properties. Many sequences with these good properties have interleaved structure, three classes of binary sequences of period 4N with optimal autocorrelation values have been constructed by Tang and Gong based on interleaving certain kinds of sequences of period N . In this pape...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IEEE Trans. Information Theory
دوره 45 شماره
صفحات -
تاریخ انتشار 1999